Dense sets of integers with prescribed representation functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense sets of integers with prescribed representation functions

Let A be a set of integers and let h ≥ 2. For every integer n, let rA,h(n) denote the number of representations of n in the form n = a1 + · · ·+ah, where ai ∈ A for 1 ≤ i ≤ h, and a1 ≤ · · · ≤ ah. The function rA,h : Z→ N, where N = N∪{0,∞}, is the representation function of order h for A. We prove that every function f : Z → N satisfying lim inf|n|→∞ f(n) ≥ g is the representation function of ...

متن کامل

Infinitely Often Dense Bases of Integers with a Prescribed Representation Function

Nathanson constructed bases of integers with a prescribed representation function, then asked how dense they can be. Chen constructed unique representation bases of integers which is infinitely often dense. In this paper, we will see how to construct bases of integers with a prescribed representation function which is infinitely often dense.

متن کامل

Infinitely Often Dense Bases for the Integers with a Prescribed Representation Function

Nathanson constructed asymptotic bases for the integers with prescribed representation functions, then asked how dense they can be. We can easily obtain an upper bound using a simple argument. In this paper, we will see this is indeed the best bound when we prescribe an arbitrary representation function.

متن کامل

On Arithmetic Structures in Dense Sets of Integers

We prove that if A ⊆ {1, . . . , N } has density at least (log log N )−c, where c is an absolute constant, then A contains a triple (a, a+d, a+2d) with d = x2+ y2 for some integers x, y, not both zero. We combine methods of T. Gowers and A. Sárközy with an application of Selberg’s sieve. The result may be regarded as a step toward establishing a fully quantitative version of the polynomial Szem...

متن کامل

Balanced Subset Sums in Dense Sets of Integers

Let 1 ≤ a1 < a2 < · · · < an ≤ 2n − 2 denote integers. Assuming that n is large enough, we prove that there exist ε1, . . . , εn ∈ {−1,+1} such that |ε1 + · · ·+εn| ≤ 1 and |ε1a1+ · · ·+εnan| ≤ 1. This result is sharp, and in turn it confirms a conjecture of Lev. We also prove that when n is even, every integer in a large interval centered at (a1 + a2 + · · · + an)/2 can be represented as the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2013

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2013.05.012